4 M ay 2 00 4 Fibonacci Rectangles

نویسنده

  • Louis H. Kauffman
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ar X iv : 0 80 5 . 09 92 v 1 [ m at h . C O ] 7 M ay 2 00 8 FIBONACCI IDENTITIES AND GRAPH COLORINGS

We generalize both the Fibonacci and Lucas numbers to the context of graph colorings, and prove some identities involving these numbers. As a corollary we obtain new proofs of some known identities involving Fibonacci numbers such as Fr+s+t = Fr+1Fs+1Ft+1 + FrFsFt − Fr−1Fs−1Ft−1.

متن کامل

ar X iv : 0 90 8 . 01 53 v 1 [ m at h . G T ] 2 A ug 2 00 9 On Fibonacci knots

We show that the Conway polynomials of Fibonacci links are Fibonacci polynomials modulo 2. We deduce that, when n 6≡ 0 (mod 4) and (n, j) 6= (3, 3), the Fibonacci knot F (n) j is not a Lissajous knot. keywords: Fibonacci polynomials, Fibonacci knots, continued fractions

متن کامل

. pl as m - p h ] 1 4 M ay 2 00 5 Two - fluid tokamak equilibria with reversed magnetic shear and sheared flow 1

X iv :p hy si cs /0 50 51 01 v1 [ ph ys ic s. pl as m -p h] 1 4 M ay 2 00 5 Two-fluid tokamak equilibria with reversed magnetic shear and sheared flow 1 G. Poulipoulis, G. N. Throumoulopoulos, H. Tasso University of Ioannina, Association Euratom Hellenic Republic, Section of Theoretical Physics, GR 451 10 Ioannina, Greece Max-Planck-Institut für Plasmaphysik, Euratom Association, D-85748 Garchi...

متن کامل

m at h . C O / 0 20 52 06 v 1 1 9 M ay 2 00 2 132 - avoiding Two - stack Sortable Permutations , Fibonacci Numbers , and Pell Numbers ∗

In [W2] West conjectured that there are 2(3n)!/((n+1)!(2n+1)!) two-stack sortable permutations on n letters. This conjecture was proved analytically by Zeilberger in [Z]. Later, Dulucq, Gire, and Guibert [DGG] gave a combinatorial proof of this conjecture. In the present paper we study generating functions for the number of two-stack sortable permutations on n letters avoiding (or containing ex...

متن کامل

ar X iv : 0 80 1 . 27 93 v 2 [ cs . C G ] 9 M ay 2 00 8 Algorithms for ε - approximations of Terrains ∗

Consider a point set D with a measure function μ : D → R. Let A be the set of subsets of D induced by containment in a shape from some geometric family (e.g. axis-aligned rectangles, half planes, balls, k-oriented polygons). We say a range space (D,A) has an ε-approximation P if max R∈A ∣

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004